Shrinkage of de~Morgan formulae under restriction

نویسندگان

  • Mike Paterson
  • Uri Zwick
چکیده

It is shown that a random restriction leaving only a fraction " of the input variables unassigned reduces the expected de Morgan formula size of the induced function by a factor of O(" 5? p 3 2) = O("

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Shrinkage of De Morgan Formulae from Quantum Query Complexity

We give a new and improved proof that the shrinkage exponent of De Morgan formulae is 2. Namely, we show that for any Boolean function f : {−1, 1} → {−1, 1}, setting each variable out of x1, . . . , xn with probability 1 − p to a randomly chosen constant, reduces the expected formula size of the function by a factor of O(p). This result is tight and improves the work of H̊astad [H̊as98] by removi...

متن کامل

On the Shrinkage Exponent for Read-Once Formulae

We prove that the size of any read-once de Morgan formula reduces on average by a factor of at least p o(1) when all but a fraction p of the input variables are randomly assigned to f0; 1g (here *) 1= log2( p 5 1) 3:27). This resolves in the a rmative a conjecture of Paterson and Zwick. The bound is shown to be tight up to a polylogarithmic factor for all p n 1= . Warning: Essentially this pape...

متن کامل

How Do Read-Once Formulae Shrink?

Let f be a de Morgan read-once function of n variables. Let f " be the random restriction obtained by independently assigning to each variable of f, the value 0 with probability (1 ? ")=2, the value 1 with the same probability, and leaving it unassigned with probability ". We show that f " depends, on the average, on only O(" n + "n 1==) variables, where = log p 5?1 2 ' 3:27. This result is asy...

متن کامل

#SAT Algorithms from Shrinkage

We present a deterministic algorithm that counts the number of satisfying assignments for any de Morgan formula F of size at most n3−16ε in time 2n−n ε · poly(n), for any small constant ε > 0. We do this by derandomizing the randomized algorithm mentioned by Komargodski et al. (FOCS, 2013) and Chen et al. (CCC, 2014). Our result uses the tight “shrinkage in expectation” result of de Morgan form...

متن کامل

Dually quasi-De Morgan Stone semi-Heyting algebras I. Regularity

This paper is the first of a two part series. In this paper, we first prove that the variety of dually quasi-De Morgan Stone semi-Heyting algebras of level 1 satisfies the strongly blended $lor$-De Morgan law introduced in cite{Sa12}. Then, using this result and the results of cite{Sa12}, we prove our main result which gives an explicit description of simple algebras(=subdirectly irreducibles) ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1991